Partition of a graph into cycles and degenerated cycles
نویسندگان
چکیده
منابع مشابه
Partition of a graph into cycles and isolated vertices
Let k, r, n be integers with k ≥ 2, 0 ≤ r ≤ k−1 and n ≥ 10k+3. We prove that if G is a graph of order n such that the degree sum of any pair of nonadjacent vertices is at least n−r, then G contains k vertexdisjoint subgraphs Hi, 1 ≤ i ≤ k, such that V (H1) ∪ . . . ∪ V (Hk) = V (G) and such that Hi is a cycle or isomorphic to K1 for each i with 1 ≤ i ≤ r, and Hi is a cycle for each i with r + 1 ...
متن کاملDegree conditions for the partition of a graph into cycles, edges and isolated vertices
Let k, n be integers with 2 ≤ k ≤ n, and let G be a graph of order n. We prove that if max{dG(x), dG(y)} ≥ (n − k + 1)/2 for any x, y ∈ V (G) with x = y and xy / ∈ E(G), then G can be partitioned into k subgraphs H1, . . . ,Hk such that Hi is a cycle or K1 or K2 for each 1 ≤ i ≤ k unless k = 2 and G = C5 or k = 3 and G = K1 ∪ C5.
متن کاملCyclically decomposing the complete graph into cycles
Let m1; m2; : : : ; mk be positive integers not less than 3 and let n= ∑k i=1 mi. Then, it is proved that the complete graph of order 2n+ 1 can be cyclically decomposed into k(2n+ 1) cycles such that, for each i= 1; 2; : : : ; k, the cycle of length mi occurs exactly 2n+ 1 times. c © 2003 Elsevier B.V. All rights reserved.
متن کاملClustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly non connected. We start by studying 3-cluster cycles, that are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case testing the c-planarity can be done efficiently and give an efficient drawing algorithm. Also, we characterize 3-cl...
متن کاملSplitting a graph into disjoint induced paths or cycles
A graph is an X-graph of Y-graphs (or two-level clustered graph) if its vertices can be partitioned into subsets (called clusters) such that each cluster induces a graph belonging to the given class Y and the graph of the clusters belongs to another given class X. Two-level clustered graphs are a useful and interesting concept in graph drawing. We consider the complexity of recognizing two-leve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00300-5